منابع مشابه
Hamiltonian double latin squares
A double latin square of order 2n on symbols s1;y; sn is a 2n 2n matrix A 1⁄4 ðaijÞ in which each aij is one of the symbols s1;y; sn and each sk occurs twice in each row and twice in each column. For k 1⁄4 1;y; n let BðA; skÞ be the bipartite graph with vertices r1;y; r2n; c1;y; c2n and 4n edges 1⁄2ri; cj corresponding to ordered pairs ði; jÞ such that aij 1⁄4 sk: We say that A is Hamiltonian i...
متن کاملCharacterizing Forbidden Pairs for Hamiltonian Squares
The square of a graph is obtained by adding additional edges joining all pair of vertices of distance two in the original graph. Particularly, if C is a hamiltonian cycle of a graph G, then the square of C is called a hamiltonian square of G. In this paper, we characterize all possible forbidden pairs, which implies the containment of a hamiltonian square, in a 4-connected graph. The connectivi...
متن کاملCacti 4.0
The original CACTI tool was released in 1994 to give computer architects a fast tool to model SRAM caches. It has been widely adopted and used since. Two new versions were released to add area and active power modeling to CACTI. This new version adds a model for leakage power and updates the basic circuit structure and device parameters to better reflect the advances in scaling semiconductors w...
متن کاملDifference labelling of cacti
A graph G is a difference graph iff there exists S ⊂ IN such that G is isomorphic to the graph DG(S) = (V,E), where V = S and E = {{i, j} : i, j ∈ V ∧ |i− j| ∈ V }. It is known that trees, cycles, complete graphs, the complete bipartite graphs Kn,n and Kn,n−1, pyramids and n-sided prisms (n ≥ 4) are difference graphs (cf. [4]). Giving a special labelling algorithm, we prove that cacti with a gi...
متن کاملEnumeration of M-ary Cacti
The purpose of this paper is to enumerate various classes of cyclically colored m-gonal plane cacti, called m-ary cacti. This combinatorial problem is motivated by the topological classiication of complex polynomials having at most m critical values, studied by Zvonkin and others. We obtain explicit formulae for both labelled and unlabelled m-ary cacti, according to i) the number of polygons, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1979
ISSN: 0095-8956
DOI: 10.1016/0095-8956(79)90041-8